Compatible discrete series

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quaternionic Discrete Series

This work investigates the discrete series of linear connected semisimple noncompact groups G. These are irreducible unitary representations that occur as direct summands of L2(G). Harish-Chandra produced discrete series representations, now called holomorphic discrete series representations, for groups G with the property that, if K is a maximal compact subgroup, then G/K has a complex structu...

متن کامل

Universality of Holomorphic Discrete Series

The goal here is to recover an apocryphal result on the structure of holomorphic discrete series representations of symplectic groups Spn(R) and unitary groups U(p, q) for sufficiently high highest weight of the lowest K-type. The same sort of argument applies to other groups of hermitian type, for example the classical groups O(n, 2) and O∗(2n). For Sp(n), the maximal compact is isomorphic to ...

متن کامل

Prediction for discrete time series

Let {Xn} be a stationary and ergodic time series taking values from a finite or countably infinite set X . Assume that the distribution of the process is otherwise unknown. We propose a sequence of stopping times λn along which we will be able to estimate the conditional probability P (Xλn+1 = x|X0, . . . , Xλn) from data segment (X0, . . . , Xλn) in a pointwise consistent way for a restricted ...

متن کامل

Incentive compatible allocation and exchange of discrete resources

Allocation and exchange of many discrete resources – such as kidneys or school seats – is conducted via direct mechanisms without monetary transfers. A primary concern in designing such mechanisms is the coordinated strategic behavior of market participants and its impact on resulting allocations. To assess the impact of this implementation constraint, we construct the full class of group domin...

متن کامل

to “ Incentive compatible allocation and exchange of discrete resources

The lemmas in Appendix C.2 show how requirements R1–R6 are driven by group strategy-proofness and Pareto efficiency. The following examples further illustrate the role of the consistency requirements R4–R6. Requirement R4 is needed to ensure the individual strategy-proofness of the TC mechanisms. This requirement is also needed to ensure the individual strategyproofness of the TTC mechanisms, a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 2003

ISSN: 0030-8730

DOI: 10.2140/pjm.2003.212.201